Decomposing Quantified Conjunctive (or Disjunctive) Formulas
نویسندگان
چکیده
منابع مشابه
Block-Sorted Quantified Conjunctive Queries
We study the complexity of model checking in quantified conjunctive logic, that is, the fragment of first-order logic where both quantifiers may be used, but conjunction is the only permitted connective. In particular, we study block-sorted queries, which we define to be prenex sentences in multi-sorted relational first-order logic where two variables having the same sort must appear in the sam...
متن کاملSolving Quantified Boolean Formulas
Solving Quantified Boolean Formulas Horst Samulowitz Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2007 Many real-world problems do not have a simple algorithmic solution and casting these problems as search problems is often not only the simplest way of casting them, but also the most efficient way of solving them. In this thesis we will present several tec...
متن کاملRational Acceptance and Conjunctive/Disjunctive Absorption
A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the coll...
متن کاملPlanning Heuristics for Conjunctive and Disjunctive Goals
Zhu, Lin. Ph.D., Purdue University, December, 2005. Planning Heuristics for Conjunctive and Disjunctive Goals. Major Professor: Robert L. Givan. Automated planning is an area of Artificial Intelligence (AI) that studies the reasoning process of anticipating the expected outcomes of action sequences and deliberately organizing them to achieve specified goals. Heuristic search based planners have...
متن کاملFilter Models for Conjunctive-Disjunctive -calculi?
The distinction between the conjunctive nature of non-determinism as opposed to the disjunctive character of parallelism constitutes the motivation and the starting point of the present work. -calculus is extended with both a non-deterministic choice and a parallel operator; a notion of reduction is introduced, extending -reduction of the classical calculus. We study type assignment systems for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2016
ISSN: 0097-5397,1095-7111
DOI: 10.1137/140957378